Assessment of Defects under Insulation Using K-Medoids Clustering Algorithm-Based Microwave Nondestructive Testing

نویسندگان

چکیده

Composite insulations, such as ceramics, are commonly utilized in the turbine system a thermal coating barrier to protect metal substrate against high temperatures and pressure. The presence of delamination composite insulations may cause failure, leading catastrophic accident. Thus, regular non-destructive testing is required detect evaluate insulation defects. Among techniques, microwave technique has emerged promising method for assessing defects ceramic coatings. Although promising, suffers from poor spatial imaging, making defect assessment challenging. In this paper, novel based on with k-medoids clustering algorithm detection proposed. representative sample scanned using Q-band open-ended rectangular waveguide 101 frequency points that operated between 33 50 GHz. measured data transformed domain time an inverse fast Fourier transform. principal component analysis then used reduce dimensionality steps into only 3 dominant attributes. attributes each inspected location classified or defect-free accurately detecting sizing insulation. results reported paper highlight superiority detection, accuracy rate 95.4%. This significant step forward compared earlier approaches identifying

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

K-Medoids Clustering Technique using Bat Algorithm

Clustering is one of the data analysis methods that are widely used in data mining. In this method, we partitioned the data into different subset which is known as cluster. Cluster analysis is the data reduction toll for classifying a “mountain‟ of information into manageable meaningful piles. This method is vast research area in the field of data mining. In this paper, a partitioning clusterin...

متن کامل

Active Distance-Based Clustering Using K-Medoids

k-medoids algorithm is a partitional, centroid-based clustering algorithm which uses pairwise distances of data points and tries to directly decompose the dataset with n points into a set of k disjoint clusters. However, k-medoids itself requires all distances between data points that are not so easy to get in many applications. In this paper, we introduce a new method which requires only a sma...

متن کامل

Document Clustering using K-Medoids

People are always in search of matters for which they are prone to use internet, but again it has huge assemblage of data due to which it becomes difficult for the reader to get the most accurate data. To make it easier for people to gather accurate data, similar information has to be clustered at one place. There are many algorithms used for clustering of relevant information in one platform. ...

متن کامل

Parallel K-Medoids++ Spatial Clustering Algorithm Based on MapReduce

Clustering analysis has received considerable attention in spatial data mining for several years. With the rapid development of the geospatial information technologies, the size of spatial information data is growing exponentially which makes clustering massive spatial data a challenging task. In order to improve the efficiency of spatial clustering for large scale data, many researchers propos...

متن کامل

Colour image segmentation using K – Medoids Clustering

K – medoids clustering is used as a tool for clustering color space based on the distance criterion. This paper presents a color image segmentation method which divides colour space into clusters. Through this paper, using various colour images, we will try to prove that K – Medoids converges to approximate the optimal solution based on this criteria theoretically as well as experimentally. Her...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Coatings

سال: 2022

ISSN: ['2079-6412']

DOI: https://doi.org/10.3390/coatings12101440